ON SOLUTION SET FOR CONVEX OPTIMIZATION PROBLEM WITH CONVEX INTEGRABLE OBJECTIVE FUNCTION AND GEOMETRIC CONSTRAINT SET
نویسندگان
چکیده
منابع مشابه
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملLevel-set methods for convex optimization
Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the roles of the objective and constraint functions, and instead approximately solves a sequence of parametric level-set problems. A zero-finding procedure, base...
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملA Level-set Method for Convex Optimization with A
Large-scale constrained convex optimization problems arise in several application 4 domains. First-order methods are good candidates to tackle such problems due to their low iteration 5 complexity and memory requirement. The level-set framework extends the applicability of first-order 6 methods to tackle problems with complicated convex objectives and constraint sets. Current methods 7 based on...
متن کاملCutting-set methods for robust convex optimization with pessimizing oracles
We consider a general worst-case robust convex optimization problem, with arbitrary dependence on the uncertain parameters, which are assumed to lie in some given set of possible values.We describe a general method for solving such a problem, which alternates between optimization and worst-case analysis. With exact worst-case analysis, the method is shown to converge to a robust optimal point. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Chungcheong Mathematical Society
سال: 2016
ISSN: 1226-3524
DOI: 10.14403/jcms.2016.29.1.29